Treewidth: Algorithmoc Techniques and Results
نویسنده
چکیده
This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more eeciently. Also, several results on graph minors are reviewed.
منابع مشابه
Treewidth: Algorithmic techniques and results
This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more e ciently. Also, several results on graph minors are reviewed.
متن کاملWeighted Treewidth Algorithmic Techniques and Results
From the analysis of algorithms for probabilistic networks, it is known that a tree decomposition of the minimum treewidth may not be optimal for these algorithms. Instead of treewidth, we consider therefore the weighted treewidth of a weighted graph. In this paper, we present a number of heuristics for determining upper and lower bounds on the weighted treewidth, and a branch and bound algorit...
متن کاملDuplicate Avoidance in Depth-First Search with Applications to Treewidth
Depth-first search is effective at solving hard combinatorial problems, but if the problem space has a graph structure the same nodes may be searched many times. This can increase the size of the search exponentially. We explore two techniques that prevent this: duplicate detection and duplicate avoidance. We illustrate these techniques on the treewidth problem, a combinatorial optimization pro...
متن کاملLP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
We give a general approach to solve various optimization problems on noisy minor-free and bounded treewidth graphs, where some fraction of the edges have been corrupted adversarially. Our results are motivated by a previous work of Magen and Moharrami, who gave a (1 + )approximate estimation algorithm for the independent set problem on noisy planar graphs, but left open the question of how to a...
متن کاملAnswer-Set Programming with Bounded Treewidth
In this paper, we present a novel approach to the evaluation of propositional answer-set programs. In particular, for programs with bounded treewidth, our algorithm is capable of (i) computing the number of answer sets in linear time and (ii) enumerating all answer sets with linear delay. Our algorithm relies on dynamic programming. Therefore, our approach significantly differs from standard AS...
متن کامل